Competitive Online Algorithms At the end of August
نویسنده
چکیده
In mid August Dexter Kozen, Joseph Newton Pew, Professor of Computer Science, Cornell University, Ithaca, NY, USA, will give a short course of six lectures on Set Constraints. Set constraints are inclusions between expressions denoting sets of ground terms. They have been used extensively in program analysis and type inference. The course will give an introduction to the theory and applications of set constraints. The lectures are:
منابع مشابه
Online Scheduling of Jobs for D-benevolent instances On Identical Machines
We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...
متن کاملPrediction of Surface Roughness by Hybrid Artificial Neural Network and Evolutionary Algorithms in End Milling
Machining processes such as end milling are the main steps of production which have major effect on the quality and cost of products. Surface roughness is one of the considerable factors that production managers tend to implement in their decisions. In this study, an artificial neural network is proposed to minimize the surface roughness by tuning the conditions of machining process such as cut...
متن کاملEfficient Data Mining with Evolutionary Algorithms for Cloud Computing Application
With the rapid development of the internet, the amount of information and data which are produced, are extremely massive. Hence, client will be confused with huge amount of data, and it is difficult to understand which ones are useful. Data mining can overcome this problem. While data mining is using on cloud computing, it is reducing time of processing, energy usage and costs. As the speed of ...
متن کاملMinimizing Loss of Information at Competitive PLIP Algorithms for Image Segmentation with Noisy Back Ground
In this paper, two training systems for selecting PLIP parameters have been demonstrated. The first compares the MSE of a high precision result to that of a lower precision approximation in order to minimize loss of information. The second uses EMEE scores to maximize visual appeal and further reduce information loss. It was shown that, in the general case of basic addition, subtraction, or mul...
متن کاملOnline Algorithms for Scheduling Weighted Packets with Deadlines in Bounded Buffers
We consider online algorithms for scheduling weighted packets with deadlines in multiple sizebounded buffers. There are m ≥ 1 buffers B1, B2, . . . , Bm. At any time, a buffer Bi can store at most bi ∈ Z packets. Packets arrive over time. Each packet is associated with a non-negative value, an integer deadline, and a target buffer that it can reside in. In each time step, only one pending packe...
متن کامل